java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:19:48,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:48,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:48,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:48,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:48,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:48,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:48,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:48,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:48,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:48,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:48,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:48,744 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:48,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:48,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:48,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:48,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:48,750 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:48,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:48,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:48,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:48,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:48,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:48,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:48,763 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:48,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:48,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:48,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:48,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:48,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:48,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:48,773 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:48,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:48,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:48,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:48,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:48,779 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:19:48,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:48,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:48,812 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:48,812 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:48,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:48,813 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:48,813 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:48,813 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:48,813 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:48,813 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:48,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:48,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:48,815 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:48,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:48,815 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:48,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:48,816 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:48,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:48,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:48,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:48,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:48,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:48,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:48,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:48,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:48,819 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:48,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:48,819 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:48,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:48,820 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:48,820 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:48,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:48,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:48,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:48,904 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:48,905 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:48,905 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl [2018-10-04 14:19:48,906 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out2.mover.bpl' [2018-10-04 14:19:48,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:48,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:48,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:48,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:48,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:49,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,028 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:19:49,028 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:19:49,028 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:19:49,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:49,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:49,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:49,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:49,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... [2018-10-04 14:19:49,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:49,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:49,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:49,057 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:49,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:49,128 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 14:19:49,129 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 14:19:49,129 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 14:19:49,732 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:19:49,733 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:49 BoogieIcfgContainer [2018-10-04 14:19:49,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:49,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:49,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:49,738 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:49,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:48" (1/2) ... [2018-10-04 14:19:49,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645f3dd4 and model type threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:49, skipping insertion in model container [2018-10-04 14:19:49,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:49" (2/2) ... [2018-10-04 14:19:49,741 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out2.mover.bpl [2018-10-04 14:19:49,752 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:49,761 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-04 14:19:49,810 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:49,811 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:49,811 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:49,811 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:49,812 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:49,812 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:49,812 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:49,812 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:49,812 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-04 14:19:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:49,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:49,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:49,837 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:49,843 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28852717, now seen corresponding path program 1 times [2018-10-04 14:19:49,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:50,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:50,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:50,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:50,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:50,076 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2018-10-04 14:19:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:50,815 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2018-10-04 14:19:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:19:50,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:19:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:50,833 INFO L225 Difference]: With dead ends: 46 [2018-10-04 14:19:50,833 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 14:19:50,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:19:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 14:19:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-10-04 14:19:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:19:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-10-04 14:19:50,883 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 5 [2018-10-04 14:19:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:50,884 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2018-10-04 14:19:50,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2018-10-04 14:19:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:50,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:50,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:50,887 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:50,887 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:50,887 INFO L82 PathProgramCache]: Analyzing trace with hash 32260834, now seen corresponding path program 1 times [2018-10-04 14:19:50,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:50,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:51,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:51,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:51,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:51,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:51,059 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 5 states. [2018-10-04 14:19:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:52,089 INFO L93 Difference]: Finished difference Result 75 states and 142 transitions. [2018-10-04 14:19:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:19:52,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:19:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:52,092 INFO L225 Difference]: With dead ends: 75 [2018-10-04 14:19:52,092 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:19:52,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 6 [2018-10-04 14:19:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:19:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-10-04 14:19:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 14:19:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2018-10-04 14:19:52,129 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 5 [2018-10-04 14:19:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:52,131 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2018-10-04 14:19:52,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2018-10-04 14:19:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:52,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:52,134 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:52,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:52,135 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:52,136 INFO L82 PathProgramCache]: Analyzing trace with hash -737820031, now seen corresponding path program 1 times [2018-10-04 14:19:52,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:52,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:52,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:52,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:52,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:52,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:19:52,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:52,278 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:52,278 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand 7 states. [2018-10-04 14:19:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:53,237 INFO L93 Difference]: Finished difference Result 198 states and 420 transitions. [2018-10-04 14:19:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:19:53,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:19:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:53,245 INFO L225 Difference]: With dead ends: 198 [2018-10-04 14:19:53,245 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 14:19:53,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 14:19:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 14:19:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2018-10-04 14:19:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 14:19:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 194 transitions. [2018-10-04 14:19:53,283 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 194 transitions. Word has length 8 [2018-10-04 14:19:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:53,283 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 194 transitions. [2018-10-04 14:19:53,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 194 transitions. [2018-10-04 14:19:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:53,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:53,287 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:53,288 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:53,288 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:53,288 INFO L82 PathProgramCache]: Analyzing trace with hash -791588849, now seen corresponding path program 1 times [2018-10-04 14:19:53,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:53,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:53,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:53,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:53,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:53,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:19:53,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:53,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:53,370 INFO L87 Difference]: Start difference. First operand 89 states and 194 transitions. Second operand 7 states. [2018-10-04 14:19:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:54,442 INFO L93 Difference]: Finished difference Result 227 states and 433 transitions. [2018-10-04 14:19:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:19:54,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:19:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:54,446 INFO L225 Difference]: With dead ends: 227 [2018-10-04 14:19:54,447 INFO L226 Difference]: Without dead ends: 223 [2018-10-04 14:19:54,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 14:19:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-04 14:19:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 112. [2018-10-04 14:19:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 14:19:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 252 transitions. [2018-10-04 14:19:54,483 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 252 transitions. Word has length 8 [2018-10-04 14:19:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:54,484 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 252 transitions. [2018-10-04 14:19:54,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 252 transitions. [2018-10-04 14:19:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:54,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:54,486 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:54,486 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:54,486 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 558061441, now seen corresponding path program 1 times [2018-10-04 14:19:54,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:54,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:54,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:54,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:54,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:54,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:19:54,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:54,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:54,592 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:54,592 INFO L87 Difference]: Start difference. First operand 112 states and 252 transitions. Second operand 7 states. [2018-10-04 14:19:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:56,127 INFO L93 Difference]: Finished difference Result 286 states and 570 transitions. [2018-10-04 14:19:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:19:56,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:19:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:56,131 INFO L225 Difference]: With dead ends: 286 [2018-10-04 14:19:56,132 INFO L226 Difference]: Without dead ends: 282 [2018-10-04 14:19:56,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 10 [2018-10-04 14:19:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-04 14:19:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 156. [2018-10-04 14:19:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-04 14:19:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 365 transitions. [2018-10-04 14:19:56,177 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 365 transitions. Word has length 8 [2018-10-04 14:19:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:56,177 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 365 transitions. [2018-10-04 14:19:56,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 365 transitions. [2018-10-04 14:19:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:56,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:56,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:56,180 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:56,180 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1066417550, now seen corresponding path program 1 times [2018-10-04 14:19:56,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:56,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:19:56,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:56,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:56,421 INFO L87 Difference]: Start difference. First operand 156 states and 365 transitions. Second operand 7 states. [2018-10-04 14:19:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:58,232 INFO L93 Difference]: Finished difference Result 351 states and 749 transitions. [2018-10-04 14:19:58,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:19:58,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:19:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:58,235 INFO L225 Difference]: With dead ends: 351 [2018-10-04 14:19:58,235 INFO L226 Difference]: Without dead ends: 347 [2018-10-04 14:19:58,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 10 [2018-10-04 14:19:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-04 14:19:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 202. [2018-10-04 14:19:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 14:19:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 490 transitions. [2018-10-04 14:19:58,291 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 490 transitions. Word has length 8 [2018-10-04 14:19:58,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:58,291 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 490 transitions. [2018-10-04 14:19:58,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 490 transitions. [2018-10-04 14:19:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:58,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:58,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:58,293 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:58,294 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1120186368, now seen corresponding path program 1 times [2018-10-04 14:19:58,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:58,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:58,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:58,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:19:58,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:58,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:58,446 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:58,447 INFO L87 Difference]: Start difference. First operand 202 states and 490 transitions. Second operand 7 states. [2018-10-04 14:19:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:59,613 INFO L93 Difference]: Finished difference Result 353 states and 758 transitions. [2018-10-04 14:19:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:19:59,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:19:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:59,617 INFO L225 Difference]: With dead ends: 353 [2018-10-04 14:19:59,618 INFO L226 Difference]: Without dead ends: 349 [2018-10-04 14:19:59,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 10 [2018-10-04 14:19:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-04 14:19:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 207. [2018-10-04 14:19:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 14:19:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 504 transitions. [2018-10-04 14:19:59,672 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 504 transitions. Word has length 8 [2018-10-04 14:19:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:59,672 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 504 transitions. [2018-10-04 14:19:59,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 504 transitions. [2018-10-04 14:19:59,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:59,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:59,674 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 14:19:59,674 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:59,674 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:59,674 INFO L82 PathProgramCache]: Analyzing trace with hash -990082056, now seen corresponding path program 1 times [2018-10-04 14:19:59,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:59,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:59,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:59,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:59,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:59,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:00,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2018-10-04 14:20:00,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:00,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:00,111 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:00,111 INFO L87 Difference]: Start difference. First operand 207 states and 504 transitions. Second operand 8 states. [2018-10-04 14:20:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:01,969 INFO L93 Difference]: Finished difference Result 396 states and 923 transitions. [2018-10-04 14:20:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:20:01,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:01,971 INFO L225 Difference]: With dead ends: 396 [2018-10-04 14:20:01,971 INFO L226 Difference]: Without dead ends: 242 [2018-10-04 14:20:01,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 14:20:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-04 14:20:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2018-10-04 14:20:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 14:20:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 479 transitions. [2018-10-04 14:20:02,029 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 479 transitions. Word has length 8 [2018-10-04 14:20:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:02,029 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 479 transitions. [2018-10-04 14:20:02,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 479 transitions. [2018-10-04 14:20:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:02,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:02,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:02,031 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:02,031 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:02,032 INFO L82 PathProgramCache]: Analyzing trace with hash -990897365, now seen corresponding path program 1 times [2018-10-04 14:20:02,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:02,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:02,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:02,578 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:02,578 INFO L87 Difference]: Start difference. First operand 202 states and 479 transitions. Second operand 7 states. [2018-10-04 14:20:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:03,678 INFO L93 Difference]: Finished difference Result 383 states and 823 transitions. [2018-10-04 14:20:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:03,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:03,681 INFO L225 Difference]: With dead ends: 383 [2018-10-04 14:20:03,681 INFO L226 Difference]: Without dead ends: 379 [2018-10-04 14:20:03,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 11 [2018-10-04 14:20:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-04 14:20:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 250. [2018-10-04 14:20:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-04 14:20:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2018-10-04 14:20:03,746 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 8 [2018-10-04 14:20:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:03,746 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2018-10-04 14:20:03,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2018-10-04 14:20:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:03,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:03,747 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:03,747 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:03,748 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1739261140, now seen corresponding path program 1 times [2018-10-04 14:20:03,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:03,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:03,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:03,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:03,880 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:03,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:03,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:03,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:03,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-10-04 14:20:03,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:03,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:03,942 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand 9 states. [2018-10-04 14:20:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:06,302 INFO L93 Difference]: Finished difference Result 648 states and 1427 transitions. [2018-10-04 14:20:06,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:20:06,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 14:20:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:06,306 INFO L225 Difference]: With dead ends: 648 [2018-10-04 14:20:06,306 INFO L226 Difference]: Without dead ends: 399 [2018-10-04 14:20:06,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 14 [2018-10-04 14:20:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-04 14:20:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 286. [2018-10-04 14:20:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-04 14:20:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 584 transitions. [2018-10-04 14:20:06,417 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 584 transitions. Word has length 10 [2018-10-04 14:20:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:06,417 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 584 transitions. [2018-10-04 14:20:06,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 584 transitions. [2018-10-04 14:20:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:06,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:06,418 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:06,419 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:06,419 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1246182800, now seen corresponding path program 1 times [2018-10-04 14:20:06,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:06,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:06,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:06,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:06,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:20:06,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:20:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:20:06,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:06,561 INFO L87 Difference]: Start difference. First operand 286 states and 584 transitions. Second operand 4 states. [2018-10-04 14:20:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:06,789 INFO L93 Difference]: Finished difference Result 471 states and 962 transitions. [2018-10-04 14:20:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:20:06,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-04 14:20:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:06,793 INFO L225 Difference]: With dead ends: 471 [2018-10-04 14:20:06,794 INFO L226 Difference]: Without dead ends: 212 [2018-10-04 14:20:06,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 14:20:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-04 14:20:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2018-10-04 14:20:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 14:20:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 321 transitions. [2018-10-04 14:20:06,846 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 321 transitions. Word has length 11 [2018-10-04 14:20:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:06,846 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 321 transitions. [2018-10-04 14:20:06,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:20:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 321 transitions. [2018-10-04 14:20:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:06,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:06,847 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:06,847 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:06,847 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1737860601, now seen corresponding path program 1 times [2018-10-04 14:20:06,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:06,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:06,946 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:06,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:07,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:07,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-04 14:20:07,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:20:07,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:20:07,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:07,057 INFO L87 Difference]: Start difference. First operand 175 states and 321 transitions. Second operand 12 states. [2018-10-04 14:20:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:08,651 INFO L93 Difference]: Finished difference Result 253 states and 430 transitions. [2018-10-04 14:20:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:20:08,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 14:20:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:08,653 INFO L225 Difference]: With dead ends: 253 [2018-10-04 14:20:08,653 INFO L226 Difference]: Without dead ends: 249 [2018-10-04 14:20:08,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 14:20:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-04 14:20:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 121. [2018-10-04 14:20:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 14:20:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 212 transitions. [2018-10-04 14:20:08,703 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 212 transitions. Word has length 11 [2018-10-04 14:20:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:08,703 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 212 transitions. [2018-10-04 14:20:08,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:20:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 212 transitions. [2018-10-04 14:20:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:20:08,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:08,704 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:08,705 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:08,705 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1883568488, now seen corresponding path program 1 times [2018-10-04 14:20:08,705 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:08,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:08,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:08,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:08,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:08,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-10-04 14:20:08,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:08,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:08,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:08,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:08,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-10-04 14:20:08,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:08,994 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:08,994 INFO L87 Difference]: Start difference. First operand 121 states and 212 transitions. Second operand 13 states. [2018-10-04 14:20:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:09,873 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2018-10-04 14:20:09,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:20:09,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-04 14:20:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:09,874 INFO L225 Difference]: With dead ends: 229 [2018-10-04 14:20:09,874 INFO L226 Difference]: Without dead ends: 225 [2018-10-04 14:20:09,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 17 [2018-10-04 14:20:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-04 14:20:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 79. [2018-10-04 14:20:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 14:20:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2018-10-04 14:20:09,924 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 11 [2018-10-04 14:20:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:09,924 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2018-10-04 14:20:09,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2018-10-04 14:20:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:09,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:09,925 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:09,925 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:09,925 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -496063517, now seen corresponding path program 1 times [2018-10-04 14:20:09,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:09,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:09,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:10,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:10,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:20:10,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:10,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-10-04 14:20:10,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:10,113 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:10,113 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand 11 states. [2018-10-04 14:20:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:12,062 INFO L93 Difference]: Finished difference Result 243 states and 409 transitions. [2018-10-04 14:20:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:20:12,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-04 14:20:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:12,064 INFO L225 Difference]: With dead ends: 243 [2018-10-04 14:20:12,065 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 14:20:12,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 20 [2018-10-04 14:20:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 14:20:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 73. [2018-10-04 14:20:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 14:20:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2018-10-04 14:20:12,136 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 13 [2018-10-04 14:20:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:12,136 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2018-10-04 14:20:12,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2018-10-04 14:20:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:12,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:12,137 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:12,137 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:12,137 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1936277035, now seen corresponding path program 1 times [2018-10-04 14:20:12,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:12,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:12,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:12,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:12,238 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:12,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:20:12,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:12,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-10-04 14:20:12,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:20:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:20:12,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:12,308 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 9 states. [2018-10-04 14:20:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:13,320 INFO L93 Difference]: Finished difference Result 202 states and 340 transitions. [2018-10-04 14:20:13,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:13,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 14:20:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:13,323 INFO L225 Difference]: With dead ends: 202 [2018-10-04 14:20:13,323 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 14:20:13,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 19 [2018-10-04 14:20:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 14:20:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 58. [2018-10-04 14:20:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 14:20:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2018-10-04 14:20:13,370 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 13 [2018-10-04 14:20:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:13,370 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2018-10-04 14:20:13,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:20:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2018-10-04 14:20:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:13,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:13,371 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:13,371 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:13,371 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1990045853, now seen corresponding path program 1 times [2018-10-04 14:20:13,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:13,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:13,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:13,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:13,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:13,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:13,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:13,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:13,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:20:13,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:13,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-04 14:20:13,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:13,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:13,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:13,531 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 11 states. [2018-10-04 14:20:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:14,801 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2018-10-04 14:20:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:20:14,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2018-10-04 14:20:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:14,801 INFO L225 Difference]: With dead ends: 188 [2018-10-04 14:20:14,802 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:20:14,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 20 [2018-10-04 14:20:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:20:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:20:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:20:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:20:14,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-10-04 14:20:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:14,804 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:20:14,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:20:14,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:20:14,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:20:14,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:14,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:15,236 WARN L178 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 151 [2018-10-04 14:20:15,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:15,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:15,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:15,582 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 144 [2018-10-04 14:20:15,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:15,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:15,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:15,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:16,620 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 210 DAG size of output: 134 [2018-10-04 14:20:16,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:16,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,177 WARN L178 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 205 [2018-10-04 14:20:17,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:17,823 WARN L178 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 203 [2018-10-04 14:20:17,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:18,477 WARN L178 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 138 [2018-10-04 14:20:18,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:18,630 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2018-10-04 14:20:18,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:18,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:18,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,330 WARN L178 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 225 [2018-10-04 14:20:19,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,724 WARN L178 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 207 [2018-10-04 14:20:19,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:19,916 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 124 [2018-10-04 14:20:19,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,270 WARN L178 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 252 [2018-10-04 14:20:20,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,496 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 169 [2018-10-04 14:20:20,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,880 WARN L178 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 186 [2018-10-04 14:20:20,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:20,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:21,251 WARN L178 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 159 [2018-10-04 14:20:21,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:21,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:21,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:21,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:21,418 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 143 [2018-10-04 14:20:23,022 WARN L178 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 150 DAG size of output: 43 [2018-10-04 14:20:24,087 WARN L178 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 142 DAG size of output: 42 [2018-10-04 14:20:25,334 WARN L178 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 127 DAG size of output: 39 [2018-10-04 14:20:26,907 WARN L178 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 195 DAG size of output: 67 [2018-10-04 14:20:28,764 WARN L178 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 187 DAG size of output: 47 [2018-10-04 14:20:29,709 WARN L178 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 40 [2018-10-04 14:20:30,466 WARN L178 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 34 [2018-10-04 14:20:32,395 WARN L178 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 219 DAG size of output: 55 [2018-10-04 14:20:35,034 WARN L178 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 193 DAG size of output: 79 [2018-10-04 14:20:35,648 WARN L178 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 34 [2018-10-04 14:20:37,870 WARN L178 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 246 DAG size of output: 69 [2018-10-04 14:20:39,594 WARN L178 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 163 DAG size of output: 54 [2018-10-04 14:20:41,282 WARN L178 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 170 DAG size of output: 54 [2018-10-04 14:20:42,410 WARN L178 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 158 DAG size of output: 39 [2018-10-04 14:20:43,091 WARN L178 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 32 [2018-10-04 14:20:43,095 INFO L421 ceAbstractionStarter]: At program point L192(lines 72 210) the Hoare annotation is: (let ((.cse2 (+ product__local__threadpooling_i_1 1)) (.cse12 (+ product__local__threadpooling_working_1 1)) (.cse6 (+ product__local__threadpooling_working_0 2))) (let ((.cse5 (<= .cse6 product__local__threadpooling_working_1)) (.cse1 (<= product__local__threadpooling_end_0 (+ product__local__threadpooling_i_0 1))) (.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= .cse12 product__local__threadpooling_end_1)) (.cse8 (= product__local__threadpooling_end_0 product__global_next)) (.cse9 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse2)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)))) (or (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3 .cse4 .cse5) (and .cse0 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) .cse1 .cse3 .cse4 (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) .cse5) (and (and (<= .cse6 product__global_next) (and (and (and .cse7 .cse1) .cse0) (<= (+ product__local__threadpooling_working_1 2) product__global_next))) .cse8 .cse9) (let ((.cse11 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse7 (<= .cse2 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse10 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse10 product__global_next) (and .cse11 .cse3 .cse0 .cse4)) (and .cse8 (and (and .cse11 .cse9) (<= .cse12 product__global_next) .cse0) (<= .cse10 product__local__threadpooling_end_0))))))) [2018-10-04 14:20:43,095 INFO L421 ceAbstractionStarter]: At program point L209(lines 50 209) the Hoare annotation is: (let ((.cse5 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse2 (<= .cse6 product__local__threadpooling_end_1)) (.cse1 (<= product__local__threadpooling_end_1 .cse5)) (.cse3 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse5 product__global_next) (not (= product__local__threadpooling_working_1 product__global_next))))) (.cse4 (+ product__local__threadpooling_working_0 1))) (or (and (and .cse0 .cse1 .cse2 .cse3) (<= .cse4 product__global_next)) (and .cse0 .cse1 .cse2 (<= .cse5 product__local__threadpooling_end_1) (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_working_1)) (and (and (<= .cse6 product__global_next) .cse1 (and .cse3 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (= product__local__threadpooling_end_0 product__global_next) (<= .cse4 product__local__threadpooling_end_0))))) [2018-10-04 14:20:43,095 INFO L421 ceAbstractionStarter]: At program point L234(lines 97 234) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_1 2)) (.cse12 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse5 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse14 (+ product__local__threadpooling_i_0 1)) (.cse13 (+ product__local__threadpooling_working_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse3 (<= .cse13 product__local__threadpooling_end_1)) (.cse11 (<= .cse14 product__global_next)) (.cse6 (<= product__local__threadpooling_end_0 .cse14)) (.cse10 (+ product__local__threadpooling_working_0 2)) (.cse7 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (and .cse12 .cse5 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse2 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse8 (<= .cse9 product__global_next)) (.cse1 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 (<= .cse1 product__global_next) .cse2 .cse3 .cse4) (and (and (or (and .cse5 .cse2 .cse6 .cse7 .cse8) (and (<= .cse9 product__local__threadpooling_i_0) .cse6 .cse7)) (<= .cse10 product__global_next)) .cse11) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse0 .cse2 .cse3 .cse11 .cse6 (<= .cse10 product__local__threadpooling_working_1)) (and .cse7 (or (and (<= .cse9 product__local__threadpooling_working_0) .cse12) (and (<= .cse13 product__global_next) .cse2 (and (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse4)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse12 .cse2 .cse8)) (<= .cse1 product__local__threadpooling_end_0))))) [2018-10-04 14:20:43,095 INFO L425 ceAbstractionStarter]: For program point productENTRY(lines 3 236) no Hoare annotation was computed. [2018-10-04 14:20:43,095 INFO L425 ceAbstractionStarter]: For program point productFINAL(lines 3 236) no Hoare annotation was computed. [2018-10-04 14:20:43,095 INFO L421 ceAbstractionStarter]: At program point L119(lines 119 124) the Hoare annotation is: (let ((.cse1 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse2 (<= product__local__threadpooling_end_0 .cse1)) (.cse4 (+ product__local__threadpooling_working_0 2)) (.cse3 (<= .cse1 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse1 product__global_next) .cse2 .cse3 (<= .cse4 product__local__threadpooling_working_1)) (and (let ((.cse6 (+ product__local__threadpooling_working_1 2)) (.cse5 (= product__local__threadpooling_end_0 product__global_next))) (or (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) .cse0 .cse2 .cse5 (<= .cse6 product__global_next)) (and (<= .cse6 product__local__threadpooling_i_0) .cse2 .cse5))) (<= .cse4 product__global_next) .cse3)))) [2018-10-04 14:20:43,096 INFO L425 ceAbstractionStarter]: For program point productErr0ASSERT_VIOLATIONASSERT(line 60) no Hoare annotation was computed. [2018-10-04 14:20:43,096 INFO L425 ceAbstractionStarter]: For program point productErr2ASSERT_VIOLATIONASSERT(line 171) no Hoare annotation was computed. [2018-10-04 14:20:43,096 INFO L421 ceAbstractionStarter]: At program point L95(lines 95 190) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_0 2)) (.cse2 (+ product__local__threadpooling_i_1 1))) (let ((.cse17 (<= .cse2 product__global_next)) (.cse9 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) (.cse19 (+ product__local__threadpooling_i_0 1)) (.cse8 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse10 (<= .cse4 product__global_next)) (.cse18 (+ product__local__threadpooling_working_1 2))) (let ((.cse5 (<= .cse18 product__global_next)) (.cse6 (<= .cse18 product__local__threadpooling_i_0)) (.cse3 (= product__local__threadpooling_end_1 product__global_next)) (.cse7 (let ((.cse20 (<= .cse4 product__local__threadpooling_i_1))) (or (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0)) .cse20 .cse10) (and .cse8 .cse20 .cse10)))) (.cse1 (<= product__local__threadpooling_end_0 .cse19)) (.cse11 (<= .cse19 product__local__threadpooling_end_0)) (.cse15 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and .cse8 .cse17) .cse9)) (.cse12 (= product__local__threadpooling_end_0 product__global_next)) (.cse13 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) (.cse0 (<= product__local__threadpooling_end_1 .cse2)) (.cse14 (+ product__local__threadpooling_working_0 1))) (or (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__global_next) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3 (<= .cse4 product__local__threadpooling_working_1) .cse5) (and (or (and .cse6 .cse0 (and (and .cse7 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0)) .cse1)) (and (and (and (and .cse8 .cse1) .cse9) .cse6 .cse0) .cse10 .cse11)) .cse12 .cse13) (and (<= .cse14 product__global_next) (and .cse15 .cse3 .cse0 .cse5)) (let ((.cse16 (and (and (and (and .cse17 .cse7) (= product__local__threadpooling_end_0 product__local__threadpooling_i_1)) .cse1) .cse11))) (or (and .cse8 .cse3 .cse0 .cse16 .cse5) (and .cse6 .cse3 .cse0 .cse16))) (and (<= .cse18 product__local__threadpooling_working_0) (and .cse15 .cse12 .cse13) .cse0 (<= .cse14 product__local__threadpooling_end_0)))))) [2018-10-04 14:20:43,096 INFO L425 ceAbstractionStarter]: For program point productErr3ASSERT_VIOLATIONASSERT(line 176) no Hoare annotation was computed. [2018-10-04 14:20:43,097 INFO L421 ceAbstractionStarter]: At program point L203(lines 143 203) the Hoare annotation is: (let ((.cse10 (+ product__local__threadpooling_i_0 1)) (.cse11 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= product__local__threadpooling_end_1 (+ product__local__threadpooling_i_1 1))) (.cse4 (<= .cse11 product__local__threadpooling_working_0)) (.cse8 (<= .cse11 product__global_next)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (= product__local__threadpooling_i_0 product__local__threadpooling_working_0)) (.cse7 (= product__local__threadpooling_end_1 product__global_next)) (.cse6 (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0))) (.cse1 (<= product__local__threadpooling_end_0 .cse10)) (.cse5 (<= .cse10 product__local__threadpooling_end_0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse5) (and (and (<= (+ product__local__threadpooling_working_0 2) product__global_next) (and (and .cse6 .cse1 .cse5) .cse7 .cse0 .cse8)) (<= (+ product__local__threadpooling_i_0 2) product__global_next)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse5) (let ((.cse9 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and (and (and .cse9 .cse1) .cse8) .cse2 .cse3 .cse5) (and .cse7 .cse6 (<= (+ product__local__threadpooling_working_0 1) product__global_next) .cse9 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse1 (<= .cse10 product__global_next) .cse5)))))) [2018-10-04 14:20:43,097 INFO L421 ceAbstractionStarter]: At program point L154(lines 154 159) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_0 1))) (let ((.cse7 (<= product__local__threadpooling_end_0 .cse4)) (.cse6 (+ product__local__threadpooling_i_1 1))) (let ((.cse2 (<= product__local__threadpooling_end_1 .cse6)) (.cse0 (and .cse7 (<= .cse6 product__global_next))) (.cse3 (+ product__local__threadpooling_working_1 2)) (.cse1 (<= .cse4 product__local__threadpooling_end_0))) (or (and (and (= product__local__threadpooling_end_1 product__global_next) (and (and .cse0 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))) .cse1) .cse2 (<= .cse3 product__global_next)) (<= (+ product__local__threadpooling_working_0 1) product__global_next) (<= .cse4 product__global_next)) (and (let ((.cse5 (= product__local__threadpooling_end_0 product__global_next)) (.cse8 (+ product__local__threadpooling_i_1 2))) (or (and .cse2 (and (and .cse5 (<= .cse6 product__local__threadpooling_end_1)) .cse7) (<= .cse8 product__local__threadpooling_end_0)) (and .cse2 .cse0 .cse5 (<= .cse8 product__local__threadpooling_i_0)))) (<= .cse3 product__local__threadpooling_i_0) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse1))))) [2018-10-04 14:20:43,097 INFO L421 ceAbstractionStarter]: At program point L121(lines 17 229) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= (+ product__local__threadpooling_working_0 2) product__global_next)) (.cse1 (<= .cse9 product__global_next))) (or (and .cse0 .cse1) (let ((.cse8 (+ product__local__threadpooling_working_1 1))) (let ((.cse2 (= product__local__threadpooling_end_1 product__global_next)) (.cse4 (<= .cse8 product__local__threadpooling_end_1)) (.cse6 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse3 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse5 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse7 (+ product__local__threadpooling_working_0 1))) (or (and .cse2 .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse2 (<= .cse7 product__global_next) .cse3 .cse4) (and (= product__local__threadpooling_end_0 product__global_next) (or (and (<= .cse8 product__global_next) .cse3 (and .cse5 (<= (+ product__local__threadpooling_i_1 1) product__global_next) .cse6)) (and .cse5 .cse3 .cse1) (and (<= .cse9 product__local__threadpooling_working_0) .cse5)) (<= .cse7 product__local__threadpooling_end_0)))))))) [2018-10-04 14:20:43,097 INFO L425 ceAbstractionStarter]: For program point productErr1ASSERT_VIOLATIONASSERT(line 82) no Hoare annotation was computed. [2018-10-04 14:20:43,098 INFO L421 ceAbstractionStarter]: At program point L196(lines 196 201) the Hoare annotation is: (let ((.cse13 (+ product__local__threadpooling_i_0 1)) (.cse19 (+ product__local__threadpooling_i_1 1)) (.cse9 (+ product__local__threadpooling_working_1 2)) (.cse20 (+ product__local__threadpooling_working_0 2))) (let ((.cse8 (+ product__local__threadpooling_i_1 2)) (.cse2 (= product__local__threadpooling_end_0 product__global_next)) (.cse3 (<= .cse20 product__global_next)) (.cse1 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (<= .cse9 product__local__threadpooling_i_0)) (.cse4 (<= .cse20 product__local__threadpooling_i_1)) (.cse7 (<= product__local__threadpooling_end_1 .cse19)) (.cse6 (<= product__local__threadpooling_end_0 .cse13)) (.cse11 (= product__local__threadpooling_end_1 product__global_next)) (.cse14 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse10 (<= .cse13 product__local__threadpooling_end_0)) (.cse15 (<= .cse20 product__local__threadpooling_working_1)) (.cse16 (<= .cse9 product__global_next))) (or (and (let ((.cse0 (and (and (= product__local__threadpooling_end_1 product__local__threadpooling_i_0) .cse5 .cse6) .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2))) (<= .cse8 product__local__threadpooling_end_0)) (and (and (<= .cse9 product__local__threadpooling_working_0) .cse6 .cse7) .cse2 .cse3 .cse10 (<= .cse8 product__local__threadpooling_i_0)) (let ((.cse12 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1))) (or (and .cse11 .cse12 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse13 product__global_next) .cse6 .cse14 .cse10 .cse15) (and (and .cse1 .cse12 .cse6 .cse2 .cse16) .cse3 .cse10))) (let ((.cse18 (+ product__local__threadpooling_i_0 2))) (or (and (and (let ((.cse17 (or (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_0)))) (or (and .cse7 .cse14 .cse17 .cse6 .cse1 .cse11 .cse10 .cse16) (and (and .cse10 (and .cse5 (and .cse17 .cse11) .cse6)) .cse7))) .cse4) (<= .cse18 product__global_next)) (and (<= .cse18 product__local__threadpooling_i_1) .cse7 .cse6 (and .cse11 .cse14 (<= .cse19 product__local__threadpooling_end_1)) .cse10 .cse15 .cse16)))))) [2018-10-04 14:20:43,098 INFO L425 ceAbstractionStarter]: For program point productEXIT(lines 3 236) no Hoare annotation was computed. [2018-10-04 14:20:43,098 INFO L421 ceAbstractionStarter]: At program point L156(lines 126 185) the Hoare annotation is: (let ((.cse2 (+ product__local__threadpooling_i_0 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse1 (<= product__local__threadpooling_end_0 .cse2)) (.cse3 (<= .cse2 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= (+ product__local__threadpooling_working_0 1) product__global_next) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse1 (<= .cse2 product__global_next) .cse3) (and (let ((.cse4 (+ product__local__threadpooling_working_1 2))) (or (and (<= .cse4 product__local__threadpooling_i_0) .cse1) (and .cse0 .cse1 (<= .cse4 product__global_next)))) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse3)))) [2018-10-04 14:20:43,098 INFO L421 ceAbstractionStarter]: At program point L214(lines 161 214) the Hoare annotation is: (let ((.cse1 (+ product__local__threadpooling_i_0 1)) (.cse3 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (<= product__local__threadpooling_end_1 .cse3)) (.cse4 (<= product__local__threadpooling_end_0 .cse1)) (.cse2 (<= .cse1 product__local__threadpooling_end_0))) (or (and (= product__local__threadpooling_end_1 product__global_next) .cse0 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) (<= .cse1 product__global_next) (<= (+ product__local__threadpooling_working_0 2) product__global_next) .cse2 (and (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1)) (<= .cse3 product__global_next) .cse4)) (and (and .cse0 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0) .cse4 (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (= product__local__threadpooling_i_0 product__local__threadpooling_working_0) .cse2)))) [2018-10-04 14:20:43,098 INFO L425 ceAbstractionStarter]: For program point productErr4ASSERT_VIOLATIONASSERT(line 181) no Hoare annotation was computed. [2018-10-04 14:20:43,099 INFO L421 ceAbstractionStarter]: At program point L198(lines 32 219) the Hoare annotation is: (let ((.cse9 (+ product__local__threadpooling_i_1 1)) (.cse11 (+ product__local__threadpooling_working_1 1)) (.cse13 (+ product__local__threadpooling_working_0 1)) (.cse14 (+ product__local__threadpooling_working_1 2))) (let ((.cse0 (<= .cse14 product__local__threadpooling_working_0)) (.cse3 (= product__local__threadpooling_end_0 product__global_next)) (.cse4 (<= .cse13 product__local__threadpooling_end_0)) (.cse6 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse7 (<= .cse11 product__local__threadpooling_end_1)) (.cse8 (+ product__local__threadpooling_working_0 2)) (.cse10 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse5 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse2 (<= product__local__threadpooling_end_1 .cse9)) (.cse12 (<= .cse14 product__global_next))) (or (and (and .cse0 (and .cse1 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) .cse2) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse0 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_working_0) .cse4) (and .cse5 .cse6 .cse7 (<= .cse8 product__local__threadpooling_working_1)) (and .cse3 (or (and (and .cse1 (<= .cse9 product__global_next) .cse10 .cse6) (<= .cse11 product__global_next)) (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) .cse1 .cse6 .cse12)) .cse4) (and .cse1 .cse10 .cse5 (<= .cse13 product__global_next) .cse6 .cse7) (or (and .cse5 (<= .cse8 product__local__threadpooling_i_1) .cse2 (<= .cse9 product__local__threadpooling_end_1) .cse12) (and (<= .cse8 product__global_next) (and (and .cse10 .cse5) .cse1 .cse2 .cse12)))))) [2018-10-04 14:20:43,099 INFO L421 ceAbstractionStarter]: At program point L207(lines 207 212) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_i_1 1)) (.cse6 (+ product__local__threadpooling_i_0 1)) (.cse7 (+ product__local__threadpooling_working_0 2))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse7 product__local__threadpooling_working_1)) (.cse2 (<= product__local__threadpooling_end_0 .cse6)) (.cse1 (<= product__local__threadpooling_end_1 .cse4)) (.cse3 (<= .cse6 product__local__threadpooling_end_0))) (or (and (and .cse0 .cse1 (<= (+ product__local__threadpooling_working_1 1) product__local__threadpooling_end_1) .cse2 .cse3 (<= .cse4 product__local__threadpooling_end_1) .cse5) (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_working_1)) (or (and .cse0 (and (= product__local__threadpooling_end_0 product__local__threadpooling_working_1) (= product__local__threadpooling_end_0 product__local__threadpooling_i_1) (not (= product__local__threadpooling_working_1 product__global_next))) .cse1 (<= .cse6 product__global_next) .cse2 .cse3 .cse5) (and (and (and (and .cse2 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0)) .cse1) (<= (+ product__local__threadpooling_working_1 2) product__global_next)) (= product__local__threadpooling_end_0 product__global_next) (<= .cse7 product__global_next) .cse3))))) [2018-10-04 14:20:43,099 INFO L421 ceAbstractionStarter]: At program point L224(lines 84 224) the Hoare annotation is: (let ((.cse22 (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0)) (.cse11 (not (= product__local__threadpooling_working_0 product__local__threadpooling_working_1))) (.cse18 (+ product__local__threadpooling_working_0 1)) (.cse25 (+ product__local__threadpooling_i_1 2)) (.cse29 (+ product__local__threadpooling_i_0 1)) (.cse26 (+ product__local__threadpooling_working_1 1)) (.cse30 (+ product__local__threadpooling_working_0 2)) (.cse27 (+ product__local__threadpooling_i_1 1)) (.cse28 (+ product__local__threadpooling_working_1 2))) (let ((.cse14 (<= .cse28 product__local__threadpooling_i_0)) (.cse13 (<= .cse27 product__local__threadpooling_end_1)) (.cse10 (<= .cse30 product__local__threadpooling_i_1)) (.cse7 (not (= product__local__threadpooling_working_1 product__local__threadpooling_i_0))) (.cse21 (<= .cse26 product__local__threadpooling_end_1)) (.cse17 (<= .cse29 product__global_next)) (.cse8 (<= .cse30 product__local__threadpooling_working_1)) (.cse6 (= product__local__threadpooling_end_1 product__global_next)) (.cse5 (<= .cse25 product__local__threadpooling_working_0)) (.cse2 (<= .cse30 product__global_next)) (.cse0 (<= product__local__threadpooling_end_1 .cse27)) (.cse23 (= product__local__threadpooling_end_1 product__local__threadpooling_working_0)) (.cse1 (<= product__local__threadpooling_end_0 .cse29)) (.cse4 (<= .cse28 product__local__threadpooling_working_0)) (.cse15 (<= .cse29 product__local__threadpooling_end_0)) (.cse3 (= product__local__threadpooling_end_0 product__global_next)) (.cse24 (<= .cse18 product__local__threadpooling_end_0)) (.cse19 (and .cse22 .cse11 (not (= product__local__threadpooling_working_1 product__global_next)))) (.cse20 (<= product__local__threadpooling_end_1 product__local__threadpooling_i_1)) (.cse9 (<= .cse28 product__global_next))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= (+ product__local__threadpooling_i_0 2) product__global_next) .cse1 (and .cse6 .cse7) .cse8 .cse9) (and .cse10 (let ((.cse12 (= product__local__threadpooling_end_0 product__local__threadpooling_i_1))) (or (and .cse11 .cse6 .cse0 .cse7 .cse12 .cse1 .cse13 .cse9) (and .cse14 .cse6 .cse0 .cse12 .cse1 .cse15 .cse13)))) (and (let ((.cse16 (= product__local__threadpooling_end_1 product__local__threadpooling_i_0))) (or (and .cse14 .cse0 .cse2 .cse1 .cse3 (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1)) .cse11 .cse16) (and .cse14 .cse0 .cse1 .cse3 .cse13 .cse10 .cse16))) .cse17) (and .cse6 (<= .cse18 product__global_next) .cse19 .cse20 .cse21) (and .cse7 .cse6 .cse20 .cse21 .cse17 .cse1 .cse8) (and (and (and .cse22 .cse11 .cse6) .cse0 .cse9) .cse2) (and .cse22 .cse0 .cse23 .cse3 .cse4 .cse24) (and .cse22 .cse0 .cse3 .cse4 .cse5 .cse24) (and (and .cse11 .cse20 .cse1 .cse3 .cse9) .cse2) (and .cse0 .cse23 .cse1 .cse3 (<= .cse25 product__local__threadpooling_i_0) .cse4 .cse15) (and .cse3 .cse24 (or (and (<= .cse26 product__global_next) (and (<= .cse27 product__global_next) .cse19 .cse20)) (and .cse22 .cse11 .cse20 .cse9)))))) [2018-10-04 14:20:43,099 INFO L425 ceAbstractionStarter]: For program point productErr5ASSERT_VIOLATIONASSERT(line 186) no Hoare annotation was computed. [2018-10-04 14:20:43,100 INFO L421 ceAbstractionStarter]: At program point L43(lines 43 48) the Hoare annotation is: (let ((.cse4 (+ product__local__threadpooling_working_1 2)) (.cse2 (+ product__local__threadpooling_i_1 1))) (let ((.cse0 (= product__local__threadpooling_end_1 product__global_next)) (.cse1 (<= product__local__threadpooling_end_1 .cse2)) (.cse3 (<= .cse4 product__global_next))) (or (and .cse0 (<= (+ product__local__threadpooling_working_0 2) product__local__threadpooling_i_1) .cse1 (<= .cse2 product__local__threadpooling_end_1) .cse3) (let ((.cse6 (and (<= product__local__threadpooling_end_0 product__local__threadpooling_i_0) (and (and (not (= product__local__threadpooling_working_1 product__local__threadpooling_working_0)) (<= .cse2 product__global_next)) (not (= product__local__threadpooling_working_0 product__local__threadpooling_i_1))))) (.cse5 (+ product__local__threadpooling_working_0 1))) (or (and (<= .cse4 product__local__threadpooling_working_0) .cse1 (= product__local__threadpooling_end_0 product__global_next) (<= .cse5 product__local__threadpooling_end_0) (and .cse6 (<= (+ product__local__threadpooling_i_1 2) product__local__threadpooling_end_0))) (and (and .cse0 .cse1 .cse6 .cse3) (<= .cse5 product__global_next))))))) [2018-10-04 14:20:43,134 INFO L202 PluginConnector]: Adding new model threadpooling_out2.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:20:43 BoogieIcfgContainer [2018-10-04 14:20:43,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:20:43,135 INFO L168 Benchmark]: Toolchain (without parser) took 54152.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 515.9 MB). Free memory was 1.5 GB in the beginning and 974.8 MB in the end (delta: 489.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:20:43,137 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:43,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:43,138 INFO L168 Benchmark]: Boogie Preprocessor took 24.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:43,138 INFO L168 Benchmark]: RCFGBuilder took 676.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:20:43,139 INFO L168 Benchmark]: TraceAbstraction took 53400.55 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 515.9 MB). Free memory was 1.4 GB in the beginning and 974.8 MB in the end (delta: 468.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-04 14:20:43,143 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 676.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53400.55 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 515.9 MB). Free memory was 1.4 GB in the beginning and 974.8 MB in the end (delta: 468.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: 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: 171]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 176]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 82]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - 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, 53.3s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 28.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 702 SDtfs, 2038 SDslu, 1097 SDs, 0 SdLazy, 7923 SolverSat, 1167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s 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.6s HoareSimplificationTime, 15 FomulaSimplificationsInter, 170126110 FormulaSimplificationTreeSizeReductionInter, 21.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 9695 SizeOfPredicates, 28 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 26/57 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-20-43-164.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out2.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-20-43-164.csv Received shutdown request...