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-00a8621 [2018-09-30 10:42:40,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:42:40,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:42:40,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:42:40,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:42:40,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:42:40,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:42:40,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:42:40,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:42:40,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:42:40,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:42:40,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:42:40,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:42:40,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:42:40,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:42:40,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:42:40,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:42:40,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:42:40,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:42:40,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:42:40,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:42:40,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:42:40,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:42:40,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:42:40,781 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:42:40,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:42:40,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:42:40,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:42:40,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:42:40,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:42:40,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:42:40,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:42:40,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:42:40,788 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:42:40,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:42:40,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:42:40,790 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-09-30 10:42:40,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:42:40,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:42:40,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:42:40,821 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:42:40,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:42:40,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:42:40,825 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:42:40,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:42:40,826 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:42:40,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:42:40,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:42:40,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:42:40,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:42:40,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:42:40,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:42:40,827 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:42:40,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:42:40,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:42:40,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:42:40,829 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:42:40,829 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:42:40,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:42:40,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:40,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:42:40,830 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:42:40,830 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:42:40,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:42:40,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:42:40,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:42:40,831 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:42:40,831 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:42:40,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:42:40,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:42:40,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:42:40,898 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:42:40,898 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:42:40,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2018-09-30 10:42:40,899 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-09-30 10:42:40,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:42:40,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:42:40,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:40,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:42:40,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:42:41,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,019 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:42:41,020 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:42:41,020 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:42:41,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:41,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:42:41,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:42:41,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:42:41,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... [2018-09-30 10:42:41,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:42:41,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:42:41,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:42:41,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:42:41,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:41,130 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:42:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:42:41,130 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:42:41,703 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:42:41,703 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:41 BoogieIcfgContainer [2018-09-30 10:42:41,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:42:41,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:42:41,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:42:41,709 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:42:41,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:40" (1/2) ... [2018-09-30 10:42:41,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baeaf29 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:42:41, skipping insertion in model container [2018-09-30 10:42:41,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:41" (2/2) ... [2018-09-30 10:42:41,713 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-09-30 10:42:41,723 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:42:41,733 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-09-30 10:42:41,798 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:42:41,799 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:42:41,799 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:42:41,799 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:42:41,799 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:42:41,800 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:42:41,800 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:42:41,800 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:42:41,800 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:42:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-09-30 10:42:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:42:41,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:41,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:42:41,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:41,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:41,846 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-09-30 10:42:41,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:41,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:42,123 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:42,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:42,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:42,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:42,142 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:42,144 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-09-30 10:42:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:44,055 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-09-30 10:42:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:42:44,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:42:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:44,075 INFO L225 Difference]: With dead ends: 46 [2018-09-30 10:42:44,075 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 10:42:44,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 10:42:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-09-30 10:42:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 10:42:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-09-30 10:42:44,126 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-09-30 10:42:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:44,126 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-09-30 10:42:44,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-09-30 10:42:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:42:44,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:44,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:42:44,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:44,129 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:44,129 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-09-30 10:42:44,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:44,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:44,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:44,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:44,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:44,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:44,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:42:44,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:42:44,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:42:44,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:44,203 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-09-30 10:42:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:45,275 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-09-30 10:42:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:42:45,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 10:42:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:45,279 INFO L225 Difference]: With dead ends: 75 [2018-09-30 10:42:45,279 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 10:42:45,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 10:42:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-09-30 10:42:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 10:42:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-09-30 10:42:45,300 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-09-30 10:42:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:45,300 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-09-30 10:42:45,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:42:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-09-30 10:42:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:42:45,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:45,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:45,302 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:45,303 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-09-30 10:42:45,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:45,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:45,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:45,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:45,755 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:45,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:42:45,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:45,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:45,756 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-09-30 10:42:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:48,246 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-09-30 10:42:48,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:42:48,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:42:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:48,250 INFO L225 Difference]: With dead ends: 198 [2018-09-30 10:42:48,250 INFO L226 Difference]: Without dead ends: 147 [2018-09-30 10:42:48,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-30 10:42:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-09-30 10:42:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 10:42:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-09-30 10:42:48,278 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-09-30 10:42:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:48,279 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-09-30 10:42:48,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-09-30 10:42:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:42:48,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:48,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:48,284 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:48,285 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-09-30 10:42:48,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:48,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:48,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:48,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:48,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:48,383 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:48,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:42:48,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:48,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:48,384 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:48,385 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-09-30 10:42:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:51,349 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-09-30 10:42:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:42:51,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:42:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:51,354 INFO L225 Difference]: With dead ends: 227 [2018-09-30 10:42:51,354 INFO L226 Difference]: Without dead ends: 223 [2018-09-30 10:42:51,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-30 10:42:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-09-30 10:42:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-30 10:42:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-09-30 10:42:51,384 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-09-30 10:42:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:51,385 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-09-30 10:42:51,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-09-30 10:42:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:42:51,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:51,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:51,387 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:51,387 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-09-30 10:42:51,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:51,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:51,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:51,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:51,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:51,468 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:51,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:42:51,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:51,469 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:51,470 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-09-30 10:42:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:54,497 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-09-30 10:42:54,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:42:54,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:42:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:54,505 INFO L225 Difference]: With dead ends: 286 [2018-09-30 10:42:54,505 INFO L226 Difference]: Without dead ends: 282 [2018-09-30 10:42:54,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-30 10:42:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-09-30 10:42:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-30 10:42:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-09-30 10:42:54,543 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-09-30 10:42:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:54,543 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-09-30 10:42:54,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-09-30 10:42:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:42:54,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:54,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:54,545 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:54,545 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-09-30 10:42:54,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:54,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:55,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:55,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:42:55,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:55,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:55,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:55,061 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-09-30 10:42:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:58,727 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-09-30 10:42:58,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:42:58,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:42:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:58,731 INFO L225 Difference]: With dead ends: 351 [2018-09-30 10:42:58,731 INFO L226 Difference]: Without dead ends: 347 [2018-09-30 10:42:58,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-30 10:42:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-09-30 10:42:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 10:42:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-09-30 10:42:58,781 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-09-30 10:42:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:58,781 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-09-30 10:42:58,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-09-30 10:42:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:42:58,783 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:58,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:58,784 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:58,784 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-09-30 10:42:58,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:58,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:58,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:42:58,894 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:58,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:42:58,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:58,895 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:58,896 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-09-30 10:43:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:01,275 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-09-30 10:43:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:43:01,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:43:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:01,281 INFO L225 Difference]: With dead ends: 353 [2018-09-30 10:43:01,281 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 10:43:01,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 10:43:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-09-30 10:43:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 10:43:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-09-30 10:43:01,332 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-09-30 10:43:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:01,332 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-09-30 10:43:01,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:43:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-09-30 10:43:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:01,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:01,334 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 10:43:01,335 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:01,335 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-09-30 10:43:01,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:01,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:01,423 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:01,423 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:01,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:01,815 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:43:01,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-09-30 10:43:01,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:43:01,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:43:01,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:01,816 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-09-30 10:43:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:04,438 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-09-30 10:43:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:43:04,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:43:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:04,440 INFO L225 Difference]: With dead ends: 396 [2018-09-30 10:43:04,441 INFO L226 Difference]: Without dead ends: 242 [2018-09-30 10:43:04,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-30 10:43:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-09-30 10:43:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-30 10:43:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-09-30 10:43:04,506 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-09-30 10:43:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:04,507 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-09-30 10:43:04,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:43:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-09-30 10:43:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:43:04,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:04,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:04,509 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:04,509 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-09-30 10:43:04,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:04,897 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:04,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:43:04,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:43:04,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:43:04,898 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:04,898 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-09-30 10:43:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:08,259 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-09-30 10:43:08,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:43:08,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:43:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:08,262 INFO L225 Difference]: With dead ends: 383 [2018-09-30 10:43:08,263 INFO L226 Difference]: Without dead ends: 379 [2018-09-30 10:43:08,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-30 10:43:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-09-30 10:43:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-30 10:43:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-09-30 10:43:08,346 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-09-30 10:43:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:08,347 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-09-30 10:43:08,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:43:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-09-30 10:43:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:43:08,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:08,348 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:08,349 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:08,349 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-09-30 10:43:08,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:08,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:08,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:08,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:08,947 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:08,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:08,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:09,191 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:43:09,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-09-30 10:43:09,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:09,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:09,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:09,192 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-09-30 10:43:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:12,722 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-09-30 10:43:12,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:43:12,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-09-30 10:43:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:12,727 INFO L225 Difference]: With dead ends: 648 [2018-09-30 10:43:12,728 INFO L226 Difference]: Without dead ends: 399 [2018-09-30 10:43:12,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-30 10:43:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-09-30 10:43:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 10:43:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-09-30 10:43:12,815 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-09-30 10:43:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:12,816 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-09-30 10:43:12,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-09-30 10:43:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:12,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:12,817 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:12,818 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:12,818 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-09-30 10:43:12,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:12,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:12,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:12,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:43:12,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:43:12,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:43:12,992 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:12,993 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-09-30 10:43:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:13,345 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-09-30 10:43:13,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:43:13,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-09-30 10:43:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:13,351 INFO L225 Difference]: With dead ends: 471 [2018-09-30 10:43:13,352 INFO L226 Difference]: Without dead ends: 212 [2018-09-30 10:43:13,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-30 10:43:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-09-30 10:43:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-30 10:43:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-09-30 10:43:13,394 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-09-30 10:43:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:13,394 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-09-30 10:43:13,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:43:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-09-30 10:43:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:13,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:13,395 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:13,396 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:13,396 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-09-30 10:43:13,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:13,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:13,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:13,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:13,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:13,540 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:13,541 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:13,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:13,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:13,656 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:13,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-09-30 10:43:13,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:43:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:43:13,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:13,657 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-09-30 10:43:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:17,003 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-09-30 10:43:17,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:43:17,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-30 10:43:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:17,006 INFO L225 Difference]: With dead ends: 253 [2018-09-30 10:43:17,006 INFO L226 Difference]: Without dead ends: 249 [2018-09-30 10:43:17,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-30 10:43:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-09-30 10:43:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 10:43:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-09-30 10:43:17,057 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-09-30 10:43:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:17,058 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-09-30 10:43:17,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:43:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-09-30 10:43:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:43:17,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:17,059 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:17,059 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:17,059 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:17,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-09-30 10:43:17,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:17,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:17,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:17,496 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:17,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:17,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:17,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:17,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:17,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-09-30 10:43:17,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:43:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:43:17,617 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:17,617 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-09-30 10:43:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:20,778 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-09-30 10:43:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:43:20,778 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 10:43:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:20,780 INFO L225 Difference]: With dead ends: 229 [2018-09-30 10:43:20,780 INFO L226 Difference]: Without dead ends: 225 [2018-09-30 10:43:20,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-30 10:43:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-09-30 10:43:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-30 10:43:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-09-30 10:43:20,826 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-09-30 10:43:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:20,826 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-09-30 10:43:20,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:43:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-09-30 10:43:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:43:20,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:20,827 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:20,827 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:20,827 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:20,827 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-09-30 10:43:20,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:20,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:20,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:20,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:20,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:20,914 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:20,914 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:20,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:20,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:43:21,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:21,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-09-30 10:43:21,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:43:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:43:21,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:21,029 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-09-30 10:43:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:25,829 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-09-30 10:43:25,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:43:25,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-09-30 10:43:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:25,831 INFO L225 Difference]: With dead ends: 243 [2018-09-30 10:43:25,831 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 10:43:25,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 10:43:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-09-30 10:43:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 10:43:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-09-30 10:43:25,881 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-09-30 10:43:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:25,881 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-09-30 10:43:25,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:43:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-09-30 10:43:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:43:25,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:25,882 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:25,882 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:25,882 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-09-30 10:43:25,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:25,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:25,963 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:25,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:25,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:25,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:43:26,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:26,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-09-30 10:43:26,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:26,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:26,055 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:26,055 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-09-30 10:43:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:29,387 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-09-30 10:43:29,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:43:29,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-09-30 10:43:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:29,390 INFO L225 Difference]: With dead ends: 202 [2018-09-30 10:43:29,390 INFO L226 Difference]: Without dead ends: 198 [2018-09-30 10:43:29,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-30 10:43:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-09-30 10:43:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-30 10:43:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-09-30 10:43:29,431 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-09-30 10:43:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:29,431 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-09-30 10:43:29,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-09-30 10:43:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:43:29,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:29,432 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:29,432 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:29,433 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-09-30 10:43:29,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:29,505 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:43:29,505 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:43:29,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:29,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:43:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:43:29,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:43:29,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-09-30 10:43:29,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:43:29,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:43:29,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:29,652 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 10 states. [2018-09-30 10:43:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:33,207 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-09-30 10:43:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:43:33,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-09-30 10:43:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:33,208 INFO L225 Difference]: With dead ends: 188 [2018-09-30 10:43:33,208 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:43:33,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:43:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:43:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:43:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:43:33,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-09-30 10:43:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:33,211 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:43:33,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:43:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:43:33,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:43:33,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:43:33,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:33,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:33,628 WARN L178 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 151 [2018-09-30 10:43:33,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:33,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:33,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:33,977 WARN L178 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 144 [2018-09-30 10:43:33,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:34,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:34,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:34,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:34,941 WARN L178 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 134 [2018-09-30 10:43:35,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,473 WARN L178 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 205 [2018-09-30 10:43:35,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:35,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:36,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:36,103 WARN L178 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 203 [2018-09-30 10:43:36,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:36,763 WARN L178 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 138 [2018-09-30 10:43:36,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:36,888 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2018-09-30 10:43:37,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,480 WARN L178 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 225 [2018-09-30 10:43:37,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:37,794 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 207 [2018-09-30 10:43:37,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,027 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 124 [2018-09-30 10:43:38,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,413 WARN L178 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 252 [2018-09-30 10:43:38,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,667 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 169 [2018-09-30 10:43:38,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:38,987 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 186 [2018-09-30 10:43:38,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:39,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:39,336 WARN L178 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 159 [2018-09-30 10:43:39,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:39,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:39,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:39,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:43:39,519 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 143 [2018-09-30 10:43:40,732 WARN L178 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 150 DAG size of output: 43 [2018-09-30 10:43:41,960 WARN L178 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 142 DAG size of output: 42 [2018-09-30 10:43:43,129 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 127 DAG size of output: 39 [2018-09-30 10:43:44,729 WARN L178 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 195 DAG size of output: 67 [2018-09-30 10:43:46,100 WARN L178 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 187 DAG size of output: 47 [2018-09-30 10:43:47,004 WARN L178 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 40 [2018-09-30 10:43:47,718 WARN L178 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 34 [2018-09-30 10:43:49,650 WARN L178 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 219 DAG size of output: 55 [2018-09-30 10:43:52,333 WARN L178 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 193 DAG size of output: 79 [2018-09-30 10:43:52,915 WARN L178 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 34 [2018-09-30 10:43:55,124 WARN L178 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 246 DAG size of output: 69 [2018-09-30 10:43:56,769 WARN L178 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 163 DAG size of output: 54 [2018-09-30 10:43:58,440 WARN L178 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 170 DAG size of output: 54 [2018-09-30 10:43:59,608 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 158 DAG size of output: 39 [2018-09-30 10:44:00,270 WARN L178 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 32 [2018-09-30 10:44:00,273 INFO L422 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-09-30 10:44:00,274 INFO L426 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-09-30 10:44:00,274 INFO L422 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-09-30 10:44:00,274 INFO L422 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-09-30 10:44:00,274 INFO L426 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-09-30 10:44:00,274 INFO L426 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-09-30 10:44:00,275 INFO L426 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-09-30 10:44:00,275 INFO L422 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-09-30 10:44:00,275 INFO L426 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-09-30 10:44:00,275 INFO L422 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-09-30 10:44:00,276 INFO L422 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-09-30 10:44:00,276 INFO L422 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-09-30 10:44:00,276 INFO L422 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-09-30 10:44:00,277 INFO L422 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-09-30 10:44:00,277 INFO L426 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-09-30 10:44:00,277 INFO L426 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-09-30 10:44:00,277 INFO L422 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-09-30 10:44:00,277 INFO L426 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-09-30 10:44:00,277 INFO L422 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-09-30 10:44:00,278 INFO L422 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-09-30 10:44:00,278 INFO L422 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-09-30 10:44:00,278 INFO L426 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-09-30 10:44:00,279 INFO L422 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-09-30 10:44:00,279 INFO L422 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-09-30 10:44:00,325 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:44:00 BoogieIcfgContainer [2018-09-30 10:44:00,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:44:00,326 INFO L168 Benchmark]: Toolchain (without parser) took 79349.02 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 512.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -160.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-30 10:44:00,328 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:44:00,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:44:00,329 INFO L168 Benchmark]: Boogie Preprocessor took 25.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:44:00,329 INFO L168 Benchmark]: RCFGBuilder took 653.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:44:00,330 INFO L168 Benchmark]: TraceAbstraction took 78620.59 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 512.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -182.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-30 10:44:00,335 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 653.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78620.59 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 512.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -182.1 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: 82]: 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: 186]: 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: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 171]: assertion always holds For all program executions holds that assertion always holds at this location - 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, 78.4s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 45.6s AutomataDifference, 0.0s DeadEndRemovalTime, 27.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 2038 SDslu, 1072 SDs, 0 SdLazy, 7853 SolverSat, 1166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 1514 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 198 NumberOfFragments, 2637 HoareAnnotationTreeSize, 15 FomulaSimplifications, 101354211071 FormulaSimplificationTreeSizeReduction, 6.2s HoareSimplificationTime, 15 FomulaSimplificationsInter, 170126110 FormulaSimplificationTreeSizeReductionInter, 20.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s 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-09-30_10-44-00-366.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-09-30_10-44-00-366.csv Received shutdown request...